double hashing

См. также в других словарях:

• Double hashing — is a computer programming technique used in hash tables to resolve hash collisions, cases when two different values to be searched for produce the same hash key. It is a popular collision resolution technique in open addressed hash tables. Like… …   Wikipedia

• Cuckoo hashing — example. The arrows show the alternative location of each key. A new item would be inserted in the location of A by moving A to its alternative location, currently occupied by B, and moving B to its alternative location which is currently vacant …   Wikipedia

• Doppel-Hashing — Beim Doppelstreuwertverfahren oder Doppel Hashing (englisch double hashing) handelt es sich um eine Methode zur Realisierung eines geschlossenen Hash Verfahrens. In geschlossenen Hash Verfahren wird versucht, Überläufer in der Hash Tabelle… …   Deutsch Wikipedia

• Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space …   Wikipedia

• List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

• Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

• Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …   Википедия

• Bloom filter — The Bloom filter, conceived by Burton H. Bloom in 1970, is a space efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be… …   Wikipedia

• Open addressing — Hash collision resolved by linear probing (interval=1). Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or searching through alternate locations in… …   Wikipedia

• Table de hachage — Une table de hachage est en informatique, une structure de données qui permet une association clé élément, c est à dire une implémentation du type abstrait table de symboles. On accède à chaque élément de la table via sa clé. Il s agit d un… …   Wikipédia en Français

• Hashmap — Table de hachage En informatique, une table de hachage est une structure de données qui permet une association clé élément, c est à dire une implémentation du type abstrait table de symboles. On accède à chaque élément de la table via sa clé. Il… …   Wikipédia en Français